Automatic Web Form Construction via Compilation of Paraconsistent Entailment to Relational Databases
نویسندگان
چکیده
This paper presents the core algorithm for a tool implementing a declarative approach to web form development. Instead of writing Javascript to implement error detection and implied value computation, web developers write an ontology in classical logic that describes the relationships between web form fields, and the Javascript is generated automatically. To meet performance demands, the compilation of classical logic into Javascript uses relational databases as an intermediary; and, to address the well-known explosiveness problem of logical implication in the presence of contradictions (web form errors), our algorithm employs a paraconsistent form of logical
منابع مشابه
Handling Inconsistency in Knowledge Bases
Real-world automated reasoning systems, based on classical logic, face logically inconsistent information, and they must cope with it. It is onerous to develop such systems because classical logic is explosive. Recently, progress has been made towards semantics that deal with logical inconsistency. However, such semantics was never analyzed in the aspect of inconsistency tolerant relational mod...
متن کاملParaconsistent Inference from Data Using Existential ω-Entailment
Existential Ω-entailment is a paraconsistent entailment relation designed to show the consequences of data which is inconsistent with a set of integrity constraints Ω. In this paper, we prove semantic properties of existential Ω-entailment and give an algorithm for computing it. Keywords-deductive databases; logic
متن کاملA Generalized Disjunctive Paraconsistent Data Model for Negative and Disjunctive Information
This paper presents a generalization of the disjunctive paraconsistent relational data model in which disjunctive positive and negative information can be represented explicitly and manipulated. There are situations where the closed world assumption to infer negative facts is not valid or undesirable and there is a need to represent and reason with negation explicitly. We consider explicit disj...
متن کاملAn Extended Generalized Disjunctive Paraconsistent Data Model for Disjunctive Information
This paper presents an extension of generalized disjunctive paraconsistent relational data model in which pure disjunctive positive and negative information as well as mixed disjunctive positive and negative information can be represented explicitly and manipulated. We consider explicit mixed disjunctive information in the context of disjunctive databases as there is an interesting interplay be...
متن کاملParaconsistent Relational Model: A Quasi-Classic Logic Approach
The well-founded model for any general deductive database computed using the paraconsistent relational model, based on four-valued logic, does not support inference rules such as disjunctive syllogism. In order to support disjunctive syllogism, we utilize the generalization of the relational model to quasi-classic (QC) logic, whose inference power is much closer to classical logic. As the parac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010